Approximate Reasoning for Contextual Databases
نویسنده
چکیده
Contextual reasoning has been proposed as a tool for solving the problem of generality in AI and for effectively handling huge knowledge bases, while approximate reasoning has been developed to overcome the computational barrier of classical deduction. This paper combines these approaches to provide an intuitive representation of knowledge and an effective deduction. Its semantics and a tableau calculus are presented. The key computational features are discussed.
منابع مشابه
Corrigendum to "Belief functions contextual discounting and canonical decompositions" [International Journal of Approximate Reasoning 53 (2012) 146-158]
Proposition 4 and Theorem 1 of the article “Belief Functions Contextual Discounting and Canonical Decompositions” [International Journal of Approximate Reasoning 53 (2012) 146–158] provide an erroneous result. We give here the true result with a correct proof.
متن کاملPROPERTY ANALYSIS OF TRIPLE IMPLICATION METHOD FOR APPROXIMATE REASONING ON ATANASSOVS INTUITIONISTIC FUZZY SETS
Firstly, two kinds of natural distances between intuitionistic fuzzy sets are generated by the classical natural distance between fuzzy sets under a unified framework of residual intuitionistic implication operators. Secondly, the continuity and approximation property of a method for solving intuitionistic fuzzy reasoning are defined. It is proved that the triple implication method for intuitio...
متن کاملApproximative Reasoning and Fuzzy Queries with Linguistic Quantification in Prolog Databases
– Approximate reasoning and fuzzy queries are efficient methods in retrieving information from large databases when precise attributes are unknown or the model itself is vague. We explore such types of reasoning based on the notions of the possibility theory. We suggest an approach towards a Prolog implementation of such queries which takes into account fuzzy linguistic quantification, aggregat...
متن کاملAccuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases
Standard databases convey Reiter’s closed-world assumption that an atom not in the database is false. This assumption is relaxed in locally closed databases that are sound but only partially complete about their domain. One of the consequences of the weakening of the closed-world assumption is that query answering in locally closed databases is undecidable. In this paper, we develop efficient a...
متن کاملA Survey of Web Scale Reasoning
for dissemination) In this document, we make a survey of the relations between Web scale reasoning and various reasoning approaches which have been developed in computer science, artificial intelligence, logics, cognitive science and other relevant areas. The investigated reasoning approaches are: approximate reasoning, resource bounded reasoning, rule-based reasoning, contextual and modular re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996